    Author: Rodney Shaghoulian
    Github: github.com/RodneyShag
HackerRank: hackerrank.com/RodneyShag


Answer: n-1

A tree with 1 node has 0 edges. For each node we connect to the tree, we must connect it using 1 additional edge.

# of nodes   # of edges
----------   ----------
    1            0
    2            1
    3            2
    4            3
    5            4
    6            5
    n           n-1
